On IP-VPN Fairness Control Mechanism using AIMD Window Flow Control

نویسندگان

  • Osamu HONDA
  • Hiroyuki OHSAKI
  • Makoto IMASE
  • Jyunichi MURAYAMA
  • Kazuhiro MATSUDA
چکیده

In recent years, IP-VPN (IP-based Virtual Private Network) that realizes a virtual dedicated line on the existing IP network has been capturing the spotlight. However, in the conventional IP-VPN, there is a problem that the fairness among IP-VPN customers is not guaranteed. In this paper, we therefore propose an IP-VPN fairness control mechanism called I2VFC (Interand Intra-VPN Fairness Control) for realizing a fair IP-VPN service at low cost. Our I2VFC performs an AIMD (Additive Increase and Multiplicative Decrease) window flow control between ingress and egress provider edge routers and realizes fairness among VPNs. Notable features of our I2VFC includes that with our I2VFC IP-VPN service provider can freely specify fairness criteria and that our I2VFC can be easily deployed to existing IP networks since modification only to provider edge routers are necessary.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scalable IP-VPN Flow Control Mechanism

In recent years, IP-based virtual private networks (IP-VPNs), which provide a virtual privately owned network over an IP network, have attracted attention. With existing IP-VPNs, however, there is a serious problem that fairness among IPVPN customers is not satisfied. In our previous work, we have proposed an IP-VPN fairness control mechanism called I2VFC (Interand Intra-VPN Fairness Control) t...

متن کامل

Additive increase adaptive decrease congestion control: a mathematical model and its experimental validation

Due to the fundamental end-to-end design principle of the TCP/IP for which the network cannot supply any explicit feedback, today TCP congestion control algorithm implements an additive increase multiplicative decrease (AIMD) algorithm. It is widely recognized that the AIMD mechanism is at the core of the stability of end-to-end congestion control. In this paper we describe a new mechanism we c...

متن کامل

A Comparison of End-to-End Congestion Control Algorithms: The Case of AIMD and AIPD

The focus of this paper is to compare two popular congestion control algorithms: AIMD (additive increase/multiplicative decrease) and AIPD (additive increase/loss proportional decrease). The key contributions of the paper are two-fold: (a) we first clarify the definitions of AIMD and AIPD congestion control algorithms, and compare them in various aspects: convergence characteristics, steady sta...

متن کامل

Fairness of the Tcp-based New Aimd Congestion Control Algorithm

Congestion control is one of the fundamental issues in computer networks. In transport control protocol (TCP) the performance of protocol is being measured based on fairness and efficiency. The fairness on round trip time (RTT) can be measured using the algorithm based on two flows or more than that. Congestion control is an effort to adapt the performance of a network to changes in the traffic...

متن کامل

Optimization of AIMD Congestion Control for Media-Streaming Applications

Media-streaming applications require smooth patterns of data transmission and also benefit from efficient resource utilization. System-wise, the underlying congestion control mechanism should achieve fairness and maintain TCP-friendliness. In this context, we optimize Additive Increase Multiplicative Decrease (AIMD) congestion control for multimedia applications, within the framework of bandwid...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007